Event processing apparatus and method based on operating system

ABSTRACT

An event processing apparatus has an event queue that accumulates a plurality of events occurred temporally. The apparatus has event queue optimization means for executing filtering processes to delete one or more event based on optimization definition information, and/or for executing chunking processes to integrate a plurality of events into an event, for a plurality of events accumulated in the event queue.

PRIORITY CLAIM

The present application claims priority from Japanese Patent Application No. 2007-243382 filed on Sep. 20, 2008, which is incorporated herein by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to an event processing apparatus and a method based on an operating system. In particular, it relates to a task execution technology of an operating system in an embedded apparatus with on-board CPU (Central Processing Unit).

2. Description of the Related Art

An embedded apparatus with on-board CPU implements an operating system. The operating system executes a plurality of events to be generated from input devices or other functional unit as a task by using the CPU. An event occurs independently with execution of application programs. Also, a task is a processing unit based on the viewpoint from the operating system (or users). Usually, tasks are executed sequentially based on an occurrence order of events.

The apparatus has event queues for accumulating these events temporarily. According to an event-driven type processing technology, these events are read out sequentially from the queue. This technology sequentially processes events. Thus, unless one event is completely processed, the following event does not be read out.

FIG. 1 is a functional configuration diagram of an event processing apparatus based on a related art.

According to FIG. 1, the apparatus 1 has an input device unit 11, a CPU unit 12, another functional unit 13 and an operating system 10. The operating system 10 is functioned by execution of programs in the CPU unit 12. The input device unit 11 generates the events corresponding to the operation of the user or the apparatus function. The events are output to the operating systems 10.

The input device unit 11 has a plurality of input devices and/or communication devices. These events generated from the input devices unit 11 have information of device/operation type, occurrence time (for example, relative time (unit in ms) from the apparatus start time), and/or operational data (for example, a keycode of a key switch, or a movement variable of a mouse).

According to FIG. 1, the operating systems 10 has an event control module 101, a plurality of event queues 102, an event processing module 103, a task queue 104 and a task executing module 105. These functional modules are realized by the programs being executed in the CPU 12.

The event control module 101 inputs the events generated from the input device unit 11 into the event queue 102. The events are put into the event queues 102 and are being a waiting state of FIFO (First In First Out). Also, the event control module 101 pulls out the events from the event queues 102. The event is output to the event processing module 103.

The event processing module 103 converts the event received from the event control module 101 into a task based on an application. The task is input into the task queue 104. The task queue 104 accumulates the task temporarily (FIFO). The task outputted from the task queue 104 is executed by the task executing module 105 using CPU.

According to the above mentioned event driven processing, when a mass of events occurred in a short time, a number of events are accumulated in the event queue 102. In such case, till processing of all events accumulated already in the event queue 102 are finished, the processing of the event is in waiting state. As a result, there has been a problem that an application responsibility becomes slow.

For this problem, according to the Japanese Patent Laid-Open No. 2000-137621, a priority is attached to an individual event, and each event is inserted into one of the plural event queue 102 selected based on its priority. According to FIG. 1, a plurality of event queues are provided, and the event is taken out from the event queue with high priority in order of precedence. About the same priority, however, the already accumulated event is taken out sequentially from the event queue.

According to the Japanese Patent Laid-Open No. 2004-287755, the event control module 101 also gives a time stamp to the event occurred. According to this technique, in the case of two events of same type, when the time interval of their time stamp is shorter than the predetermined threshold value, the event control module 101 executes only one event and deletes the other event. Thereby, the situation that many events stay in the event queue is prevented. For example, when a user of the apparatus operates the same key repeatedly many times, an event based on these key operations can be deleted.

In recent years, the above mentioned OS is also implemented to the terminal with lower computing capability like a cellular phone or a personal digital assistance. Because of miniaturization and high efficiency of device technology, a pointing device (a key switch, a mouse or a track-point), a ten key, full-keyboard, an acceleration sensor and a touch panel are also equipped on or connected to a small embedded apparatus as input devices. Furthermore, through short distance radio communication techniques such as infrared or Bluetooth, there are input devices which operate an application executed on a cellular phone. For example, there is a wireless mouse and a wireless remote controller with a built-in acceleration sensor. Because an event occurred by such input devices is converted into a task and the task is executed, even on a cellular phone, pointing operations or scrolling operation can be executed like a personal computer.

However, the computing performance of CPU equipped with a cellular phone is considerably low than that of CPU equipped with a personal computer. Therefore, depending on user operations to the cellular phone, there is a case that a large amount of events occur serially from the input devices in a short time. 53 In this case, it is necessary to execute these events effectively.

According to the technique described in Japanese Patent Laid-Open No. 2000-137621, addition of priority information to each event increases an amount of information by the priority information. Also, the use efficiency of memory becomes low because of the necessity of managing a plurality of event queues. Furthermore, in the case of having a plurality of event queues, the input and output order of events are different, if the relation of order in FIFO will be held, the use efficiency of memory becomes low more.

According to the technique described in Japanese Patent Laid-Open No. 2004-287755, an event that should not be deleted is possible to be deleted by mistake, because the event is deleted only based on the time interval of the time stamp.

BRIEF SUMMARY OF THE INVENTION

An object of the present invention is to provide an event processing apparatus and method being able to process effectively a large amount of events occurred in a short time, even if in the case of embedded apparatus equipped with CPU with low computing performance and implemented OS.

The present invention is based on an event processing apparatus having an event queue that accumulates a plurality of events occurred temporarily.

According to the present invention, the apparatus has event queue optimization means for executing filtering processes to delete one or more event based on optimization definition information, and/or for executing chunking processes to integrate a plurality of events into an event, for a plurality of events accumulated in the event queue.

It is preferred that the event processing apparatus as claimed in claim 1, wherein the event queue optimization means dynamically selects the filtering processes and/or the chunking processes depending on a CPU load.

It is preferred that the apparatus further has task queue for temporarily accumulating a plurality of tasks relating to a plurality of events read out from the event queue, and CPU load calculation means for calculating a task execution time for all unexecution tasks accumulated in the task queue as a CPU load.

It is preferred that the apparatus further has task execution means for executing a task read out from the task queue, and task execution time memory for receiving the task execution time from the task execution means, and for storing a mean execution time corresponding to a task identifier, wherein, the CPU load calculation means calculates the CPU load by dividing sum of mean execution time for all unexecution tasks accumulated in the task queue by CPU processing time unite by use of the task execution time memory.

It is preferred that the apparatus further has the event queue optimization means is executed at each predetermined time or at optimization indication based on operation of user.

It is preferred that the event has device/operation type, occurrence time and/or operation data, the optimization definition information defines predetermined conditions for the device/operation type, the occurrence time and/or the operation data in case of executing the filtering processes and/or the chunking processes, and the event queue optimization means decides whether all events accumulated in the event queue corresponds to the predetermined conditions of the optimization definition information.

It is preferred that the event queue optimization means executes with phased following steps,

as the filtering processes,

for one event, operated variable filtering for deleting the event in case that operation data are undefined or the operated variable are smaller than predetermined threshold values, and

for a plurality of succeeding events of same type, time filtering for deleting these events in case that occurrence time intervals for these events are smaller than predetermined threshold values, and

as the chunking processes,

same type event chunking for integrating these events into one event in case that a plurality of succeeding events of same device/operation type occur consecutively within predetermined time interval, and

different type event chunking for integrating these events into one event in case that a plurality of events of different device/operation type correspond to predetermined conditions.

It is preferred that the event queue optimization means locks the event queue for stopping temporally input/output of events before the filtering processes and/or the chunking processes, and unlocks after executing the filtering processes and/or the chunking processes.

It is preferred that the predetermined conditions for the optimization definition information are changed depending on CPU processing capability and/or memory capacity.

The present invention is based on an event processing method for making a computer to function for controlling execution of tasks based on a plurality of events accumulated temporally in an event queue.

According to the present invention, the method has the steps of, for a plurality of events accumulated in the event queue, executing filtering processes to delete one or more event based on optimization definition information, and/or executing chunking processes to integrate a plurality of events into an event.

According to the event processing apparatus of the present invention and the method, because the number of events accumulated in the event queue can be reduced based on optimization definition information, a large number of events that occurred in a short time can be processed effectively, even if in the case of embedded apparatus equipped with CPU with low computing performance and implemented OS.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

FIG. 1 is a functional configuration diagram of an event processing apparatus based on a related art.

FIG. 2 is a functional configuration diagram of an event processing apparatus in the present invention.

FIG. 3 is an example of a mean execution time accumulated in a task execution time memory.

FIG. 4 is a flowchart of an event queue optimization module in the present invention.

FIG. 5 is an optimization illustration for an event queue in the present invention.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 2 is a functional configuration diagram of an event processing function in the present invention.

Comparing to FIG. 1, operating system 10 in FIG. 2 further has a task execution time memory 106, a CPU load calculation module 107 and an event queue optimization module 108. These functional modules are realized by programs executed by the CPU unit 12.

The task execution time memory 106 receives a task identifier and a task execution time from the task execution module 105. The task identifier specifically includes a task ID (IDentifier) and a segment routine ID. The event processing module 103 generates the task based on the application from an event, and the task is divided into segment routines (SR, Segment Routine). The segment routines are units generated by subdividing one task corresponding to an execution breakpoint described as an execution command. Thus, whenever the task execution module 105 executes a subdivided segment routine, an attribute of the segment routine, namely the task ID and a segment routine ID, and a task execution time, are output to the task execution time memory 106.

The task execution time memory 106 stores the mean execution time of the task associated with the task ID and the segment routine ID. The task execution time memory 106 updates the mean execution time of the task, whenever receiving the task execution time from the task execution module 105.

The CPU load calculation module 107 calculates the execution time for all unexecution tasks accumulated in the task queue 104 as a CPU load. The CPU load calculation module 107, therefore, receives task IDs and segment routine IDs for all unexecution tasks accumulated in the task queue 104.

Then, the CPU load calculation module 107 receives each mean execution time for every task ID and segment routine ID from the task execution time memory 106.

The CPU load calculation module 107 calculates CPU load by dividing a total summation of each mean execution time for all unexecution tasks accumulated in the task queue 104 by CPU processing time unit. The CPU load calculated by the following equation is output to the event queue optimization module 108 at every predetermined time.

CPU load=total summation of mean execution time for all unexecution tasks/CPU transaction time unit.

FIG. 3 shows an example of a mean execution time accumulated in the task execution time memory 106.

According to FIG. 3, three tasks A, B and C based on an application are shown. Here, the OS is assumed to execute in a single-thread mode, but it seems to work in a pseudo multi-thread mode. Each task has plural segment routines. The task A has segment routines SRA1-SRA6, the task B has segment routines SRB1-SRB4, and the task C has segment routines SRC1-SRC7.

According to FIG. 3, these segment routines are executed in order of segment routine SRA1 of task A, segment routine SRB1 of task B and segment routine SRC1 of task C. Next, these segment routines are executed in order of segment routine SRA2 of task A, segment routine SRB2 of task B and segment routine SRC2 of task C. In FIG. 3, the execution sequence of the segment routine of tasks A, B and C is shown.

The execution order of segment routines of a task is not limited to executing the segment routine of each task one by one in turn as shown in FIG. 3. For example, it is allowed that all segment routines of the task A are executed first and then all segment routines of the task B are executed. It is also allowed that a plurality of segment routines is executed in one time slice (execution time unit).

The task execution time memory 106 stores each mean execution time associated with the task ID and the segment routine ID. According to FIG. 3, for example, the mean execution time of segment routine 1 of task A is 55 ms.

Also, according to FIG. 3, segment routines accumulated in the task queue 104 at the moment are SRA4, SRA5, SRA6, SRB4, SRC4, SRC5, SRC6 and SRC7. Then, according to FIG. 3, the sum of the mean execution time for each segment routine and CPU load Ct are as follows:

SRA4=55 ms, SRA5=160 ms, SRA6=60 ms, SRB4=50 ms,

SRC4=60 ms, SRC5=50 ms, SRC6=200 ms and SRC7=200 ms.

Thus, the sum of these mean execution time equals 835 ms (=55 ms+160 ms+60 ms+50 ms+60 ms+50 ms+200 ms+200 ms). By assuming CPU processing time equals 1000 ms, CPU load Ct is 0.835 (=835 ms/1000 ms).

Then, referring to FIG. 2, the operating system 10 of the present invention further has the event queue optimization module 108. The event queue optimization module 108 executes “filtering process” to delete one or more events accumulated in the event queue 102 and/or “chunking process” to integrate plural events into one event, based on optimization definition information.

The optimization definition information defines predetermined conditions for “device/operation type”, “occurrence time” and/or “operation data” in the case of executing “filtering process” and/or “chunking process”. The event queue optimization module 108 determines whether all events accumulated in the event queue 102 correspond to predetermined conditions of the optimization definitions information.

According to the present invention, the filtering process is “operated variable filtering” and “time-based filtering”, and the chunking process is “same type event chunking” and “different type event chunking”. The event queue optimization module 108 executes one of these four processes by selecting a process dynamically and step by step according to the CPU load.

[Operated Variable Filtering]

For an event, if the operation data are undefined or the operated variable is smaller than the predetermined threshold value, the event is deleted. For example, regarding to an event for movement of a pointing device such as a mouse, when the operated variable (movement distance (Euclidean distance) of the mouse per unit time) is smaller than a predetermined threshold value, the event is deleted. Also, about an event of a key pressing in a mobile keyboard such as a ten-key or a full-keyboard, when a key-code corresponding to the key being pressed is undefined, the event is deleted.

[Time Filtering]

For a plurality of succeeding events of same type, if the occurent time interval of these events is shorter than a predetermined threshold value, the succeeding events are deleted. For example, event for movement in a pointing device such as a mouse occurs consecutively, and if the occurrence time interval of these events is shorter than a predetermined threshold value, the succeeding events are deleted. Also, an event of key pressing on a mobile key-board such as ten-key or full-keyboard occurs consecutively, when the time interval of these events is shorter than a predetermined threshold value, the succeeding events are deleted.

[Same Type Event Chunking]

When plural events of the same device/operation type occur consecutively during a predetermined period of time, these events are integrated into one event. For example, when events of movement in the pointing device such as a mouse occur consecutively, these events are integrated into one event having an operated variable which is summed operated variables of these events. Also, when events of key press in mobile key-board such as the ten-key or full-keyboard occurs N times consecutively and correspond to “an arrow key”, these events are integrated into one event associating the number of N times. Furthermore, when evens of the key-board pressing occur consecutively, and a key-code of the pressing key is “a key for task change”, only the last event is executed and the former event is deleted.

[Different Type Event Chunking]

When plural events of different device/operation type satisfy predetermined conditions, events are integrated into one event. For example, in the situation that a pointing device such as a mouse and a mobile key-board such as a ten-key or a full-keyboard is used, more than two sets of an event for pressing “a key for task change” and subsequent event of movement of a mouse are assumed to occurs consecutively in shorter time interval than the predetermined threshold value. In such case, Mouse/Move events are integrated into one event, and the last event of the “key for task change” is remained by deleting the former event of the “key for task change”.

Also, more than two sets of an event for pressing “a decision key” of a keyboard and a subsequent event of mouse click are assumed to occur successively in a shorter time interval than a predetermined threshold value. In such case, while the event occurred first is deleted, the event occurred later is processed.

FIG. 4 is a flowchart of the event queue optimization module in the present invention.

(S401) First of all, the event queue optimization module 108 inputs CPU load Ct from the CPU load calculation module 107. The CPU load Ct is an estimated load for actual execution of scheduled tasks accumulated in the task queue.

(S402) Then, it is determined whether the CPU load Ct is larger than a threshold value k1 or not. It is here determined whether the processing delay larger than the threshold value k1 occurs or not. When the load Ct is less than or equal to the value k1 (k1≧Ct), the process is finished. In this case, the event queue 102 accumulates event itself without any optimization (reconfiguration). As a result, the event control module 101 takes out events in an order of their occurrences from the event queue 102.

(S403) In the case that the load Ct is larger than the value k1 (k1<Ct), namely, the processing delay larger than the value k1 occurs, the event queue 102 is locked to stop the input and output of the events. After having locked the event queue 102, an optimization process is executed with respect to a plurality of events accumulated there.

(S404) At first, it is determined whether the CPU load Ct corresponds to the threshold value k1-k4. The optimization process, namely, uses several types of filtering processes and chunking processes dynamically and step by step depending on the CPU load Ct. “The filtering process” deletes one or more events based on the optimization definition information for plural events accumulated to the event queue 102. Also, “the chunking process” integrates plural events into one event based on the optimization definition information. Threshold values for decision have a relation of k1<k2<k3<k4. All these threshold values are constants of less than or equal to 1. These values, for example, are allowed to be k1=0.1, k2=0.25, k3=0.5, k4=0.75. These four threshold values may be predetermined or dynamically based on the history information of tasks executed in the past.

(S405) In the case that the load Ct is larger than the value k1, and smaller than or equal to the value k2 (k1<Ct<=k2), only an “operated variable filtering” is executed.

(S406) In the case that the load Ct is larger than the value k2, and smaller than or equal to the value k3 (k2<Ct<=k3), the “operated variable filtering” is executed first.

(S407) Subsequently, the “time filtering” is executed.

(S408) In the case that the load Ct is larger than the value k3, and smaller than or equal to the value k4 (k3<Ct<=k4), “operated variable filtering” is executed first.

(S409) Subsequently the “time filtering” is executed.

(S410) And the “same type event chunking” is executed.

(S411) In the case that the load Ct is larger than the value k4 (k4<Ct), the “operated variable filtering” is executed first.

(S412) Subsequently the “time filtering” is executed.

(S413) Subsequently the “same type event chunking” is executed.

(S414) And the “different type event chunking” is executed.

According to these steps (S405-S414), an optimization for the event queue are changed corresponding to the value of CPU load Ct. In other words, when the load Ct is small, numbers of the applied optimization processes are reduced, and when the load Ct is large, numbers of applied optimization processes are increased. Thereby, by suppressing the decrease of task execution speed, event processing determined to be unnecessary in a task execution can be reduced.

(S415) When optimization processes for the event queue (S405-S414) are finished, the event queue 102 is locked to resume input and output of event.

Note that an order (S405-S414) of the optimization processes executed step by step may be other orders without limiting to the above-mentioned order. For example, it may be an order of “time filtering”->“operated variable filtering”->“same type events chunking”->“different type events chunking”.

However, for optimization processing of the event queue, it should be given with a high priority to these processing that have little cost consumption such as a CPU load or an amount of memory used and a high performance effect after the optimization process. For example, many events that are objects of chunking processes become objects of filtering processes. Then, according to the embodiment in the present invention, an application of “filtering process” may be before an application of “chunking process”.

FIG. 5 is an illustration of before and after an optimization of the event queue in the present invention.

FIG. 5 (a) shows information of the event queue before an optimization processing.

The device/operation types are Mouse/Move, Mouse/Click, MobileKeyboard/Press and FullKeyboard/Press. Also, the event group (event ID: 0001-0024) occurring at the time 66460-69510 is shown.

(S501) First, it is assumed that the operated variable filtering process in the optimization definition information is prescribed as shown in table 1.

TABLE 1 Operated variable filtering process Device/operation Processing type processing condition method Mouse/Move movement distance delete is less than Ma Keyboard/Press keycode is undefined delete

Here, for example, the movement distance Ma is assumed to be four pixels. According to FIG. 5 (a), each event corresponding to the optimization definition information has event ID “0004”, “0009”, “0018”, “0024” respectively. The device type of these events is “Mouse/Move”, and the movement distances are less than four pixels. Then, these events are deleted by an operated variable filtering process.

(S502) Next, a time filtering process in the optimization definition information is assumed to be prescribed as shown in the following table 2.

TABLE 2 Time filtering process Device/operation Processing type Processing condition method Mouse/Move Event occurrence from latest delete event is less than T1 Mouse/Click Event occurrence from latest delete event is less than T2 Keyboard/Press Event occurrence from latest delete event is less than T3

Here, for example, it is assumed that T1=100 ms, T2=200 ms and T3=300 ms. After processing of the step S501, each event corresponding to the optimization definition information has event ID “0017”, “0020” respectively. The device type of these events is “Mouse/Move”, and the time interval for event occurrences is less than 100 ms. These events are deleted by a time filtering process.

(S503) Then, a same type event filtering process in the optimization definition information is assumed to be prescribed shown in the following table 3.

TABLE 3 Same type event chunking process Device/operation Processing type Processing conditions method Mouse/Move same type event occur more Integrate into than two successively one event Keyboard/Press same type event occur more Integrate into than two successively and one event key code is “direction key” Keyboard/Press same type event occur more Processing of than two successively and the last event key code is “key for task only change”

After processing of the step S502, each set of events corresponding to the optimization definition information has the set of event IDs “0003:0005”, “0010:0011:0012” and “0016:0019:0021” respectively. As for the set of event IDs “0003:0005”, the device/operation type is “Mouse/Move”, and the same events continue. Three events are integrated into one event with event ID “0005”, and three operated variable of these events are summed to be an operated variable associating the one event. Similarly the events with a set of event IDs “0010:0011:0012” are integrated into one event with event ID “0012”. Furthermore, the events with a set of event IDs “0016: 0019: 0021” are integrated into one event with event ID “0021”.

(S504) Then, a different type event filtering process in the optimization definition information is assumed to be prescribed shown in the following table 4.

TABLE 4 Different type event chunking process Device/operation type Processing conditions Processing method Mouse/Move Two events occur more than After processing Keyboard/Press two repeatedly and the last event successively within T4 and relating to keycode is “key for task keycode, change” processing for integrating events relating to movement of mouse cursor into a event Mouse/Click Two events occur After deleting Keyboard/Press successively within T5 and event occurred keycode is “key for first, processing decision” event occurred last

For example, here, it is assumed T4=1200 ms and T5=600 ms. After processing of the step S503, the group of events corresponding to the optimization definition information has the set of event IDs “0012:0013:0014:0015”. These events repeat device/operation type “Mouse/Move” and “MobileKeyboard/Press” alternately. Also, key-code is “key for task change” corresponding to the key “F1” “F2”. Then, two events of “Mouse/Move” are integrated into one event, further, the event with a former “key for task change” is deleted, and the event with the last “key for task changing” is leaved.

The event group before optimization shown in FIG. 5 (a) is processed through the steps S501-S504, and becomes to be the event group after the optimization shown in FIG. 5 (b). According to FIG. 5, while the event group before optimization has 24 events, after optimization, the number of events is decreased to 11 events.

Note that the predetermined conditions for the optimization definition information are desirable to be changed according to the capacity of memory and/or the processing capability of CPU on the apparatus. For example, numeric values for the time interval of event occurrence can be changed.

According to the present invention, event number accumulated in the event queue can be reduced, while the processing of CPU is specially needed in order to optimize the event queue. One of tasks assumed to utilize the present inventions is a rendering processing of a screen, however the amount of the processing is very large. For example, there is the event such as a drag and drop of a window on a desktop by mouse operation. In such case, compared to the amount of processing for the optimization of the event queue, the amount of re-rendering processing is very large. Thus, the effect of the present invention processing an optimization of the event queue is large in order to execute the re-rendering process faster.

Also, other filtering processes or chunking processes can be applicable without restricting four optimization processing method explained in the embodiment. For example, not only based on an operated variable at the occurrence time of the event or occurent time interval, but an operated variable per unit time or the increase/decrease of an amount of the change is applicable. Further, in case of summation of Euclid data involved in events, the summation becomes zero occasionally. Thus when plural events are substituted as one event, the substitution is executed after having analyzed the semantics of a series of events. For example, when a mouse is moved circularly, the event of the mouse is converted into an event representing the circular motion.

According to the event processing apparatus and the method of the present invention explained in detail, because the number of events accumulated in an event queue can be reduced based on optimization definition information, even if an embedded apparatus equipped with the low computing performance CPU and implementing OS, a large number of events occurred in a short time can effectively processed.

According to the present invention, particularly in the case of embedded apparatus equipped with CPU with low computing performance like a cellular phone or a personal digital assistance, and in the case of operating a window showed on the display of the apparatus by a pointing device like a mouse, number of events accumulated in an event queue decreases effectively. The present invention is also able to be applied to various apparatus without considering the relation between CPU processing capability and task processing capability, because of executing an event queue optimization process dynamically and step by step depending on the fluctuation of CPU load in real time.

The present invention is able to delete events decided to be unnecessary for task execution reliably, because of execution of filtering processes or chunking processes for event group accumulated in the event queue by considering of event occurrence order, device/operation type, occurrence time and operation data.

Many widely different embodiments of the present invention may be constructed without departing from the spirit and scope of the present invention. It should be understood that the present invention is not limited to the specific embodiments described in the specification, except as defined in the appended claims. 

1. An event processing apparatus having an event queue that accumulates a plurality of events occurred temporarily, wherein the apparatus comprising: event queue optimization means for executing filtering processes to delete one or more event based on optimization definition information, and/or for executing chunking processes to integrate a plurality of events into an event, for a plurality of events accumulated in said event queue.
 2. The event processing apparatus as claimed in claim 1, wherein said event queue optimization means dynamically selects the filtering processes and/or the chunking processes depending on a CPU load.
 3. The event processing apparatus as claimed in claim 2, wherein the apparatus further has task queue for temporarily accumulating a plurality of tasks relating to a plurality of events read out from said event queue, and CPU load calculation means for calculating a task execution time for all unexecution tasks accumulated in said task queue as a CPU load.
 4. The event processing apparatus as claimed in claim 3, wherein the apparatus further has task execution means for executing a task read out from said task queue, and task execution time memory for receiving the task execution time from said task execution means, and for storing a mean execution time corresponding to a task identifier, wherein, said CPU load calculation means calculates the CPU load by dividing sum of mean execution time for all unexecution tasks accumulated in said task queue by CPU processing time unite by use of said task execution time memory.
 5. The event processing apparatus as claimed in claim 1, wherein, said event queue optimization means is executed at each predetermined time or at optimization indication based on operation of user.
 6. The event processing apparatus as claimed in claim 1, wherein, said event has device/operation type, occurrence time and/or operation data, the optimization definition information defines predetermined conditions for the device/operation type, the occurrence time and/or the operation data in case of executing the filtering processes and/or the chunking processes, and said event queue optimization means decides whether all events accumulated in said event queue corresponds to the predetermined conditions of the optimization definition information.
 7. The event processing apparatus as claimed in claim 6, wherein, the event queue optimization means executes with phased following steps, as the filtering processes, for one event, operated variable filtering for deleting the event in case that operation data are undefined or the operated variable are smaller than predetermined threshold values, and for a plurality of succeeding events of same type, time filtering for deleting these events in case that occurrence time intervals for these events are smaller than predetermined threshold values, and as the chunking processes, same type event chunking for integrating these events into one event in case that a plurality of succeeding events of same device/operation type occur consecutively within predetermined time interval, and different type event chunking for integrating these events into one event in case that a plurality of events of different device/operation type correspond to predetermined conditions.
 8. The event processing apparatus as claimed in claim 1, wherein, said event queue optimization means locks the event queue for stopping temporally input/output of events before the filtering processes and/or the chunking processes, and unlocks after executing the filtering processes and/or the chunking processes.
 9. The event processing apparatus as claimed in claim 1, wherein, the predetermined conditions for the optimization definition information are changed depending on CPU processing capability and/or memory capacity.
 10. An event processing method for making a computer to function for controlling execution of tasks based on a plurality of events accumulated temporally in an event queue, wherein the method comprising the steps of: for a plurality of events accumulated in said event queue, executing filtering processes to delete one or more event based on optimization definition information, and/or executing chunking processes to integrate a plurality of events into an event. 